<?php
/**
 * <https://y.st./>
 * Copyright © 2019 Alex Yst <mailto:copyright@y.st>
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program. If not, see <https://www.gnu.org./licenses/>.
**/

$xhtml = array(
	'<{title}>' => 'No used scanner',
	'takedown' => '2017-11-01',
	'<{body}>' => <<<END
<img src="/img/CC_BY-SA_4.0/y.st./weblog/2019/01/09.jpg" alt="Geese" class="framed-centred-image" width="649" height="480"/>
<section id="dreams">
	<h2>Dream journal</h2>
	<p>
		I dreamed I was able to slow my decent when falling.
		I knew I was dreaming; the odd part was that I questioned real-world physics.
		I thought I should try to remember to test to see if I could do the same thing in the waking world.
		Obviously, once awake, I remembered things don&apos;t work that way.
		I guess whatever part of my brain keeps track of basic laws of reality is switched off when I&apos;m asleep.
	</p>
</section>
<section id="scanner">
	<h2>Scanner</h2>
	<p>
		My trip to get a scanner from the recycling centre was a bust.
		It seems they do stock them, but they sell them as quickly as they come in.
		They&apos;ve got none right now, and on any given visit, it&apos;s unlikely they&apos;ll have one in.
	</p>
</section>
<section id="drudgery">
	<h2>Drudgery</h2>
	<p>
		My discussion posts for the day:
	</p>
	<blockquote>
		<p>
			Those are great examples of where we see something like the Zipf distribution.
			Paying attention to the distribution, we can arrange records to be more efficient in look-ups, both by requiring less look-ups and by keeping the right things in $a[RAM].
			In sorting by access likelihood, it pays to know the exact order that would be best.
			The closer you get to that order, the more performance you can squeeze out.
			For $a[RAM] usage, there&apos;s more wiggle room, as you can keep quite a bit of the often-used stuff in memory, and you can cycle out the stuff that doesn&apos;t get used often.
		</p>
	</blockquote>
	<blockquote>
		<p>
			You make a good point about Prolog&apos;s backtracking capabilities.
			A brute force solution is still attempted, but instead of starting from the beginning every time there&apos;s a failed result, Prolog goes back a step and tries another option.
			This saves a lot of resources, speeding Prolog up considerably.
			It makes Prolog behave similarly to traversing a tree structure.
		</p>
		<p>
			I&apos;m not sure how you&apos;re setting Prolog to use the tree form you described, but if you&apos;re right that Prolog can do that, that&apos;d mean not all problems written in Prolog are solved with any sort of brute force at all.
			I&apos;ll have to look into that further.
		</p>
	</blockquote>
</section>
END
);
